Strategyproof prot sharing: a two-agent characterization
نویسنده
چکیده
Two agents jointly operate a decreasing marginal returns technology to produce a private good. We characterize the class of output-sharing rules for which the labor-supply game has a unique Nash equilibrium. It consists of two families: rules of the serial type which protect a small user from the negative externality imposed by a large user, and rules of the reverse serial type, where one agent e¤ectively employs the other agents labor. Exactly two rules satisfy symmetry; a result in sharp contrast with Moulin and Shenkers (Econometrica, 1992) characterization of their serial mechanism as the unique cost -sharing rule satisfying the same incentives property. We also show that the familiar stand alone test characterizes the class of xed-path methods (Friedman, Economic Theory, 2002) under our incentives criterion. Keywords: Joint production, serial rule, decreasing serial rule, strategyproofness. JEL classi cation numbers: C72, D23, D62. I am grateful to Hervé Moulin for a stimulating conversation.
منابع مشابه
On Budget-Balanced Group-Strategyproof Cost-Sharing Mechanisms
A cost-sharing mechanism defines how to share the cost of a service among serviced customers. It solicits bids from potential customers and selects a subset of customers to serve and a price to charge each of them. The mechanism is group-strategyproof if no subset of customers can gain by lying about their values. There is a rich literature that designs group-strategyproof cost-sharing mechanis...
متن کاملStrategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models
We consider a strategic variant of the facility location problem. We would like to locate a facility on a closed interval. There are n agents spread on that interval, divided into two types: type 1 agents, who wish for the facility to be as far from them as possible, and type 2 agents, who wish for the facility to be as close to them as possible. Our goal is to maximize a form of aggregated soc...
متن کاملGroup strategyproof cost sharing: The role of indifferences
Every agent reports his willingness to pay for one unit of a good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP ) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an indifferent agent is always served. With the minimalist rule (MIN) an indifferent agent does not ge...
متن کاملProt sharing in unique Nash equilibrium: characterization in the two-agent case
Two agents jointly operate a decreasing marginal returns technology to produce a private good. We characterize the class of output-sharing rules for which the labor-supply game has a unique Nash equilibrium. It consists of two families: rules of the serial type which protect a small user from the negative externality imposed by a large user, and rules of the reverse serial type, where one agent...
متن کاملShare the Multicast Payment Fairly
Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certain fair way has been studied widely in literature. When the agents, either the links or the nodes, in the network are selfish, it is desirable to pay the agents in a proper way such that each agent still reveals its t...
متن کامل